J. Symbolic Computation (1996) 11, 1{000 Symbolic Constraints in Constructive Geometric Constraint Solving
نویسندگان
چکیده
In design and manufacturing applications, users of computer aided design systems want to de ne relationships between dimension variables, since such relationships express design intent very exibly. This work reports on a technique developed to enhance a class of constructive geometric constraint solvers with the capability of managing functional relationships between dimension variables. The method is shown to be correct.
منابع مشابه
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equations. We give complete methods of deciding whether the constraints are independent and whether a constraint system is over-constraint. Also, over-constrainted systems can be handled naturally. Based on symbolic computation, we ...
متن کاملCombining Uniication and Built-in Constraints (extended Abstract)
In less than a decade, Deduction with Constraints (DwC) has opened a new universe in computer science. DwC can be viewed from two perspectives: one related to the automated deduction framework 17, 19], the other to the development and usage of programming languages based on logic 7, 14]. Within the automated deduction framework, constraints on the generic data structure \terms" have become a po...
متن کاملA 2D geometric constraint solver using a graph reduction method
Keywords: Geometric constraints Modeling by constraints Graph-constructive solver Decomposition–recombination (DR) planning Graph algorithms Under-constrained problems a b s t r a c t Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the desig...
متن کاملEncoding Relative Orientation and Mereotopology Relations with Geometric Constraints in CLP(QS)
One approach for encoding the semantics of spatial relations within a declarative programming framework is by systems of polynomial constraints. However, solving such constraints is computationally intractable in general (i.e. the theory of realclosed fields), and thus far the proposed symbolic algebraic methods do not scale to real world problems. In this paper we address this intractability b...
متن کاملA Geometric Relaxation Solver for Parametric Constraint-Based Models
In this paper, a new relaxation algorithm for solving geometric constraint-based models is proposed. The algorithm starts from a constructive symbolic representation of objects (Constructive Parametric Solid Model, CPSM) and proceeds by iterative relaxation of the geometric constraints. Models that can be reduced to distance and angle constraints can be handled. A new algorithm based on an iter...
متن کامل